from math import ceil
from math import sqrt
t = int(input())
s = {}
for i in range(t):
n,d = map(int,input().split())
s[i] = [n,d]
for key,value in s.items():
n = int(value[0])
d = int(value[1])
if d > n:
flag = True
for x in range(1,ceil(sqrt(d))):
total = 0
y = ceil(float(d)/(x+1))
total = x + y
if total <= n:
flag = True
break
else:
flag = False
if flag == True:
print('YES')
else:
print('NO')
else:
print('YES')
#include <bits/stdc++.h>
using namespace std;
int main() {
int t,n,d;
cin>>t;
while(t--){
cin>>n>>d;
bool possible = false;
for (int i = 0; i < n; i++)
{
if ((i+d)/(i+1) <= n-i) {
possible = true;
break;
}
}
if (possible) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |